Subsampling algorithms for semidefinite programming
نویسندگان
چکیده
منابع مشابه
Target following Algorithms for Semidefinite Programming
We present a target-following framework for semidefinite programming, which generalizes the target-following framework for linear programming. We use this framework to build weighted path-following interior-point algorithms of three distinct flavors: short-step, predictor-corrector, and large-update. These algorithms have worst-case iteration bounds that parallel their counterparts in linear pr...
متن کاملSublinear time algorithms for approximate semidefinite programming
We consider semidefinite optimization in a saddle point formulation where the primal solution is in the spectrahedron and the dual solution is a distribution over affine functions. We present an approximation algorithm for this problem that runs in sublinear time in the size of the data. To the best of our knowledge, this is the first algorithm to achieve this. Our algorithm is also guaranteed ...
متن کاملSemidefinite Programming and Approximation Algorithms: A Survey
Computing approximately optimal solutions is an attractive way to cope with NP-hard optimization problems. In the past decade or so, semidefinite programming or SDP (a form of convex optimization that generalizes linear programming) has emerged as a powerful tool for designing such algorithms, and the last few years have seen a profusion of results (worst-case algorithms, average case algorithm...
متن کاملDerandomizing Semidefinite Programming Based Approximation Algorithms
Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP Complete problems namely Max Cut Max k Cut Max Sat Max Dicut Max Bisection k Vertex Coloring Independent Set etc These breakthroughs all involve polynomial time randomized algorithms based upon Semide nite Programming a technique pioneered by Goemans and Williamson In this paper we give te...
متن کاملDerandomizing Approximation Algorithms Based on Semidefinite Programming
Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP-hard problems, namely Max-Cut, Max k-Cut, Max-Sat, Max-Dicut, Max-bisection, k-vertex coloring, maximum independent set, etc. All these breakthroughs involve polynomial time randomized algorithms based upon semidefinite programming, a technique pioneered by Goemans and Williamson. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2011
ISSN: 1946-5238
DOI: 10.1214/10-ssy018